Inapproximability of the Smallest Superpolyomino Problem
نویسنده
چکیده
We consider the smallest superpolyomino problem: given a set of colored polyominoes, find the smallest polyomino containing each input polyomino as a subshape. This problem is shown to be NP-hard, even when restricted to a set of polyominoes using a single common color. Moreover, for sets of polyominoes using two or more colors, the problem is shown to be NP-hard to approximate within a O(n1/3−ε)-factor for any ε > 0.
منابع مشابه
Inapproximability for Metric Embeddings into R
We consider the problem of computing the smallest possible distortion for embedding of a given n-point metric space into Rd, where d is fixed (and small). For d = 1, it was known that approximating the minimum distortion with a factor better than roughly n1/12 is NP-hard. From this result we derive inapproximability with a factor roughly n1/(22d−10) for every fixed d ≥ 2, by a conceptually very...
متن کاملOn Approximating Four Covering/Packing Problems With Applications to Bioinformatics
In this paper, we consider approximability of four covering/packing type problems which have important applications in computational biology. The problems considered in this paper are the triangle packing problem, the full sibling reconstruction problem under two parsimonious assumptions, the maximum profit coverage problem and the 2-coverage problem. We provide approximation algorithms and ina...
متن کاملInapproximability Results for Guarding Polygons and Terrains 1
Past research on art gallery problems has concentrated almost exclusively on bounds on the numbers of guards needed in the worst case in various settings. On the complexity side, fewer results are available. For instance, it has long been known that placing a smallest number of guards for a given input polygon is NP-hard. In this paper we initiate the study of the approximability of several typ...
متن کاملCourse ”Proofs and Computers“, JASS’06 Probabilistically Checkable Proofs
Before introducing probabilistically checkable proofs, I shortly give an overview of the historical development in the field of inapproximability results which are closely related to PCPs. A foundational paper from Johnson in 1974 states approximation algorithms and inapproximability results for Max SAT, Set Cover, Independent Set, and Coloring. While the decision problems for various problems,...
متن کاملReducing the value of the optimum: FPT inapproximability for Set Cover and Clique, in super exponential time in opt
In Fixed Parameter Tractability (FPT) theory, we are given a problem with a special parameter k. In this paper we are only interested in k equal the size of the optimum. A FPT algorithm for a problem is an exact algorithm that runs in time h(k) · nO(1) for a function h that may be arbitrarily large. In FPT approximation we seek a g(k) ratio that runs in time h(k) · nO(1), so that h,g are two in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1210.3877 شماره
صفحات -
تاریخ انتشار 2012